Shortest Paths Routing on Arbitrary Networks (k Urzeste-wege-routing in Beliebigen Netzwerken)
ثبت نشده
چکیده
منابع مشابه
Shortest Paths Routing in Arbitrary Networks
We introduce an on{line protocol which routes any set of N packets along shortest paths with congestion C and dilation D through an arbitrary network in O(C +D +log N) steps, with high probability. This time bound is optimal up to the additive log N, and it has previously only been reached for bounded{degree leveled networks. Further, we show that the above bound holds also for random routing p...
متن کاملShortest-Path Routing in Arbitrary Networks
We introduce an on-line protocol which routes any set of N packets along shortest paths with congestion C and dilation D through an arbitrary network in O(C +D+log N) steps, with high probability. This time bound is optimal up to the additive log N , and it has previously only been reached for bounded-degree leveled networks. Further, we show that the above bound holds also for random routing p...
متن کاملOn the Representability of Arbitrary Path Sets as Shortest Paths: Theory, Algorithms, and Complexity
The question, whether an optional set of routes can be represented as shortest paths, and if yes, then how, has been a rather scarcely investigated problem up until now. In turn, an algorithm that, given an arbitrary set of traffic engineered paths, can efficiently compute OSPF link weights as to map the given paths to shortest paths may be of huge importance in today’s IP networks, which still...
متن کاملUsing a Fuzzy Rule-based Algorithm to Improve Routing in MPLS Networks
Today, the use of wireless and intelligent networks are widely used in many fields such as information technology and networking. There are several types of these networks that MPLS networks are one of these types. However, in MPLS networks there are issues and problems in the design and implementation discussion, for example security, throughput, losses, power consumption and so on. Basically,...
متن کاملMulti-Dimensional Interval Routing Schemes
Interval Routing Scheme (k-IRS) is a compact routing scheme on general networks. It has been studied extensively and recently been implemented on the latest generation INMOS Transputer Router chip. In this paper we introduce an extension of the Interval Routing Scheme k-IRS to the multi-dimensional case hk; di-MIRS, where k is the number of intervals and d is the number of dimensions. Whereas k...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994